Arboricity and bipartite subgraph listing algorithms
نویسندگان
چکیده
منابع مشابه
Arboricity and Bipartite Subgraph Listing Algorithms
In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O(n). We describe a linear time algorithm to list such subgraphs. The arboricity bound is necessary: for any constant k and any n there exists an n-vertex graph with O(n) edges and (n/ log n) maximal complete bipartite subgraphs Kk,`. ∗Work supported in part by NSF grant CCR-9258355.
متن کاملEfficient Algorithms for Subgraph Listing
Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and show that it cannot be extended to general subgraphs of fixed size. Then, we consider the algorithm due to Gąsieniec et al. for finding multiple...
متن کاملGraphs and Algorithms Solutions Exercise 1 (large Bipartite Subgraph)
We will create the partitioning by adding the vertices of V to A or B one by one. Let us assume V ′ is the set of vertices we have already added and at least half of the edges in G[V ′] are in between A and B. Now if u is the next vertex to insert we will greedily add it to A if |Γ(u) ∩ B| > |Γ(u) ∩ A| otherwise we add it to B. Thus after inserting u the invariant that at least half of the edge...
متن کاملSmall bipartite subgraph polytopes
We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these descriptions were used to compute the integrality ratio of various relaxations of the max-cut problem, again for up to eight nodes.
متن کاملNew algorithms for $k$-degenerate graphs
A graph is k-degenerate if any induced subgraph has a vertex of degree at most k. In this paper we prove new algorithms finding cliques and similar structures in these graphs. We design linear time Fixed-Parameter Tractable algorithms for induced and non induced bicliques. We prove an algorithm listing all maximal bicliques in time O(k(n−k)2), improving the result of [D. Eppstein, Arboricity an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1994
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)90121-x